Batch Scheduling with Time Restriction and Clique Search
نویسندگان
چکیده
We consider a graph whose vertices are legally colored using k colors and ask if the contains -clique. As it turns out this very special type of -clique problem is in an intimate connection with constructing schedules. The practicality clique search based construction schedules checked by carrying numerical experiments.
منابع مشابه
Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint
This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facili...
متن کاملReal time scheduling of batch systems
The approach presented in this article is based on the real time simulation of p-time Petri net for the real time scheduling of batch systems. After defining the different kinds of constraints which can exist in a linear hybrid production system, we present the conflict resolution principle used by a token player algorithm at the global coordination level.
متن کاملSolving a chemical batch scheduling problem by local search
A chemical batch scheduling problem is modeled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real world data.
متن کاملShop and batch scheduling with constraints
This is a summary of the PhD thesis defended by the author in September 2011 at thé Ecole des Mines de Nantes (EMNantes). The thesis was advised by Narendra Jussien (EMNantes) and co-advised by Louis-Martin Rousseau (´ Ecole Polytechnique de Montréal – Poly), Christelle Guéret (EMNantes) and André Langevin (Poly). The manuscript is written in French and can be obtained from The focus of the dis...
متن کاملBatch Repair with Heuristic Search
Troubleshooting is the task of fixing an abnormally behaving system. Many troubleshooting algorithms employ a diagnosis engine that returns a set of diagnoses Ω and their likelihoods (p(·)), where a diagnosis ω ∈ Ω is a set of components that may have been faulty and its likelihood p(ω) is the probability that ω is all the faulty components in the system. The Batch Repair Problem (BRP) is a rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Pannonica
سال: 2023
ISSN: ['0865-2090']
DOI: https://doi.org/10.1556/314.2023.00004